Stack orders topic
Stack orders are typically not used directly, but are instead passed to stack.order.
Functions
-
stackOrderAppearance(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the earliest series (according to the maximum value) is at the bottom.
-
stackOrderAppearance(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the earliest series (according to the maximum value) is at the bottom.
-
stackOrderAppearance(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the earliest series (according to the maximum value) is at the bottom.
-
stackOrderAscending(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the smallest series (according to the sum of values) is at the bottom.
-
stackOrderAscending(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the smallest series (according to the sum of values) is at the bottom.
-
stackOrderAscending(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the smallest series (according to the sum of values) is at the bottom.
-
stackOrderDescending(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the largest series (according to the sum of values) is at the bottom.
-
stackOrderDescending(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the largest series (according to the sum of values) is at the bottom.
-
stackOrderDescending(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the largest series (according to the sum of values) is at the bottom.
-
stackOrderInsideOut(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the earliest series (according to the maximum value) are on the inside and the later series are on the outside.
-
stackOrderInsideOut(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the earliest series (according to the maximum value) are on the inside and the later series are on the outside.
-
stackOrderInsideOut(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns a series order such that the earliest series (according to the maximum value) are on the inside and the later series are on the outside.
-
stackOrderNone(
List< Stack orders StacksList< series) → List<List< >num> >int> -
Returns the given series order [0, 1, … n - 1] where n is the number
of elements in
series
. Thus, the stack order is given by the key accessor (see Stack.keys). -
stackOrderNone(
List< Stack orders StacksList< series) → List<List< >num> >int> -
Returns the given series order [0, 1, … n - 1] where n is the number
of elements in
series
. Thus, the stack order is given by the key accessor (see Stack.keys). -
stackOrderNone(
List< Stack orders StacksList< series) → List<List< >num> >int> -
Returns the given series order [0, 1, … n - 1] where n is the number
of elements in
series
. Thus, the stack order is given by the key accessor (see Stack.keys). -
stackOrderReverse(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns the reverse of the given series order [n - 1, n - 2, … 0] where n is the number of elements in series. Thus, the stack order is given by the reverse of the key accessor (see Stack.keys).
-
stackOrderReverse(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns the reverse of the given series order [n - 1, n - 2, … 0] where n is the number of elements in series. Thus, the stack order is given by the reverse of the key accessor (see Stack.keys).
-
stackOrderReverse(
List< Stack orders StacksList< series) → List<List< >num> >int> - Returns the reverse of the given series order [n - 1, n - 2, … 0] where n is the number of elements in series. Thus, the stack order is given by the reverse of the key accessor (see Stack.keys).
Typedefs
-
StackOrder
= Iterable<
int> Function(List<List< ) Stack orders StacksList< >num> > - The definition of a stack order: given the generated series list, it must return an list of numeric indices representing the stack order.
-
StackOrder
= Iterable<
int> Function(List<List< ) Stack orders StacksList< >num> > - The definition of a stack order: given the generated series list, it must return an list of numeric indices representing the stack order.
-
StackOrder
= Iterable<
int> Function(List<List< ) Stack orders StacksList< >num> > - The definition of a stack order: given the generated series list, it must return an list of numeric indices representing the stack order.